Oo-line Algorithms for the List Update Problem
نویسنده
چکیده
Optimum oo-line algorithms for the list update problem are investigated. The list update problem involves implementing a dictionary of items as a linear list. Several characterizations of optimum algorithms are given; these lead to optimum algorithm which runs in time 2 n (n ? 1)!m, where n is the length of the list and m is the number of requests. The previous best algorithm, an adaptation of a more general algorithm due to Manasse et al. 9], runs in time (n!) 2 m.
منابع مشابه
Off-Line Algorithms for the List Update Problem
Optimum oo-line algorithms for the list update problem are investigated. The list update problem involves implementing a dictionary of items as a linear list. Several characterizations of optimum algorithms are given; these lead to an implementation of an optimumalgorithm which runs in time O(2 n n!m), where n is the length of the list and m is the number or requests. The previous best algorith...
متن کاملA Competitive Analysis of the List Update
We consider the question of lookahead in the list update problem: What improvement can be achieved in terms of competitiveness if an on-line algorithm sees not only the present request to be served but also some future requests? We introduce two diierent models of lookahead and study the list update problem using these models. We develop lower bounds on the competitiveness that can be achieved ...
متن کاملSelf-Organizing Data Structures
We survey results on self-organizing data structures for the search problem and concentrate on two very popular structures: the un-sorted linear list, and the binary search tree. For the problem of maintaining unsorted lists, also known as the list update problem, we present results on the competitiveness achieved by deterministic and random-ized on-line algorithms. For binary search trees, we ...
متن کاملOnline Algorithms for Self-Organizing Sequential Search - A Survey
The main objective of this survey is to present the important theoretical and experimental results contributed till date in the area of online algorithms for the self organizing sequential search problem, also popularly known as the List Update Problem(LUP) in a chronological way. The survey includes competitiveness results of deterministic and randomized online algorithms and complexity result...
متن کاملThe influence of lookahead in competitive on-line algorithms
In the competitive analysis of on-line problems, an on-line algorithm is presented with a sequence of requests to be served. The on-line algorithm must satisfy each request without the knowledge of any future requests. We consider the question of lookahead in on-line problems: What improvement can be achieved in terms of competitiveness, if the on-line algorithm sees not only the present reques...
متن کامل